The Locomotive Routing Problem

Given a schedule of trains, the locomotive planning (or scheduling) problem (LPP) is to determine the minimum cost assignment of locomotive types to trains that satisfies a number of business and operational constraints. Once this is done, the railroad has to determine the sequence of trains to which each locomotive is assigned by unit number so that it can be fueled and serviced as necessary. We refer to this problem as the locomotive routing problem (LRP). The LRP is a very large scale combinatorial optimization problem, and the general version that we consider has previously been unstudied and unsolved in the research literature. In this paper, we develop robust optimization methods to solve the LRP. There are two major constraints that need to be satisfied by each locomotive route: (1) locomotive fueling constraints, which require that every unit visits a fueling station at least once for every F miles of travel, and (2) locomotive servicing constraints, which require that every unit visits a service station at least once for every S miles of travel. The output of the LPP is not directly implementable because the LPP does not consider these fueling and servicing constraints. The LRP considers these constraints and its output is therefore implementable. We model the LRP by considering alternative fueling and servicingfriendly train paths (or strings) between servicing stations on the network. We formulate the LRP as an integer programming problem on a suitably constructed space-time network and show that this problem is NP-complete. This integer programming problem has millions of decision variables. We develop a fast aggregation-disaggregation based algorithm to solve the problem within a few minutes of computational time to near-optimality. Finally, we present computational results and extensive case studies of our algorithms on real data provided by a major Class I US railroad.